Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

f(x, a(a(b(b(y))))) → f(a(a(a(b(b(b(x)))))), y)
f(a(x), y) → f(x, a(y))
f(b(x), y) → f(x, b(y))

Q is empty.


↳ QTRS
  ↳ AAECC Innermost

Q restricted rewrite system:
The TRS R consists of the following rules:

f(x, a(a(b(b(y))))) → f(a(a(a(b(b(b(x)))))), y)
f(a(x), y) → f(x, a(y))
f(b(x), y) → f(x, b(y))

Q is empty.

We have applied [15,7] to switch to innermost. The TRS R 1 is none

The TRS R 2 is

f(x, a(a(b(b(y))))) → f(a(a(a(b(b(b(x)))))), y)
f(a(x), y) → f(x, a(y))
f(b(x), y) → f(x, b(y))

The signature Sigma is {f}

↳ QTRS
  ↳ AAECC Innermost
    ↳ QTRS
      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f(x, a(a(b(b(y))))) → f(a(a(a(b(b(b(x)))))), y)
f(a(x), y) → f(x, a(y))
f(b(x), y) → f(x, b(y))

The set Q consists of the following terms:

f(x0, a(a(b(b(x1)))))
f(a(x0), x1)
f(b(x0), x1)


Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

F(b(x), y) → F(x, b(y))
F(a(x), y) → F(x, a(y))
F(x, a(a(b(b(y))))) → F(a(a(a(b(b(b(x)))))), y)

The TRS R consists of the following rules:

f(x, a(a(b(b(y))))) → f(a(a(a(b(b(b(x)))))), y)
f(a(x), y) → f(x, a(y))
f(b(x), y) → f(x, b(y))

The set Q consists of the following terms:

f(x0, a(a(b(b(x1)))))
f(a(x0), x1)
f(b(x0), x1)

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ AAECC Innermost
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof

Q DP problem:
The TRS P consists of the following rules:

F(b(x), y) → F(x, b(y))
F(a(x), y) → F(x, a(y))
F(x, a(a(b(b(y))))) → F(a(a(a(b(b(b(x)))))), y)

The TRS R consists of the following rules:

f(x, a(a(b(b(y))))) → f(a(a(a(b(b(b(x)))))), y)
f(a(x), y) → f(x, a(y))
f(b(x), y) → f(x, b(y))

The set Q consists of the following terms:

f(x0, a(a(b(b(x1)))))
f(a(x0), x1)
f(b(x0), x1)

We have to consider all minimal (P,Q,R)-chains.
We deleted some edges using various graph approximations

↳ QTRS
  ↳ AAECC Innermost
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F(b(x), y) → F(x, b(y))
F(a(x), y) → F(x, a(y))
F(x, a(a(b(b(y))))) → F(a(a(a(b(b(b(x)))))), y)

The TRS R consists of the following rules:

f(x, a(a(b(b(y))))) → f(a(a(a(b(b(b(x)))))), y)
f(a(x), y) → f(x, a(y))
f(b(x), y) → f(x, b(y))

The set Q consists of the following terms:

f(x0, a(a(b(b(x1)))))
f(a(x0), x1)
f(b(x0), x1)

We have to consider all minimal (P,Q,R)-chains.